A memetic algorithm to solve the dynamic multiple runway aircraft landing problem
نویسندگان
چکیده
منابع مشابه
Hybrid Algorithms for the Multiple Runway Aircraft Landing Problem
Over the past few decades, air traffic has experienced a tremendous Growth. However, as the air traffic develops, the limitation of the runway becomes the bottleneck during the airport operation and scheduling aircraft landing present a complex daily task encountered by most air traffic control towers. In this paper, we study the Multiple Runway case of the Aircraft Landing Problem (MRALP), whi...
متن کاملHybrid Genetic-cuckoo Search Algorithm for Solving Runway Dependent Aircraft Landing Problem
As the demand for air transportation continues to grow, some flights cannot land at their preferred landing times because the airport is near its runway capacity. Therefore, devising a method for tackling the Aircraft Landing Problem (ALP) in order to optimize the usage of existing runways at airports is the focus of this study. This study, a hybrid Genetic-Cuckoo Search (GCS) algorithm for opt...
متن کاملAn exact algorithm for Aircraft Landing Problem
This paper addresses the problem of scheduling aircraft landings at an airport. Given a set of planes and runways, the objective is to minimize the total (weighted) deviation from the target landing time for each plane. There are costs associated with landing either earlier or later than a target landing time for each plane. Each plane has to land on one of the runways within its predetermined ...
متن کاملA Honey Bee Algorithm To Solve Quadratic Assignment Problem
Assigning facilities to locations is one of the important problems, which significantly is influence in transportation cost reduction. In this study, we solve quadratic assignment problem (QAP), using a meta-heuristic algorithm with deterministic tasks and equality in facilities and location number. It should be noted that any facility must be assign to only one location. In this paper, first o...
متن کاملA dynamic programming approach for the aircraft landing problem with aircraft classes
The capacity of a runway system represents a bottleneck at many international airports. The current practice at airports is to land approaching aircraft on a first-come, first-served basis. An active rescheduling of aircraft landing times increases runway capacity or reduces delays. The problem of finding an optimal schedule for aircraft landings is referred to as the “aircraft landing problem”...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of King Saud University - Computer and Information Sciences
سال: 2016
ISSN: 1319-1578
DOI: 10.1016/j.jksuci.2015.09.002